Basic simple type theory
نویسندگان
چکیده
منابع مشابه
A Basic Extended Simple Type Theory
This paper presents an extended version of Church’s simple type theory called Basic Extended Simple Type Theory (bestt). By adding type variables and support for reasoning with tuples, lists, and sets to simple type theory, it is intended to be a practical logic for formalized mathematics.
متن کاملTerminating Tableaux for the Basic Fragment of Simple Type Theory
We are interested in higher-order fragments of classical simple type theory [1, 6] for which it is decidable whether a formula is satisfied by a standard model. Only few such fragments are known: • The propositional fragment, which is obtained by admitting no other base type but the type of truth values. In this case decidability follows from the fact that all types are interpreted as finite se...
متن کاملDualized Simple Type Theory
We propose a new bi-intuitionistic type theory called Dualized Type The-ory (DTT). It is a simple type theory with perfect intuitionistic duality, and correspondsto a single-sided polarized sequent calculus. We prove DTT strongly normalizing, andprove type preservation. DTT is based on a new propositional bi-intuitionistic logic calledDualized Intuitionistic Logic (DIL) that bui...
متن کاملSimple nominal type theory
Nominal logic is an extension of first-order logic with features useful for reasoning about abstract syntax with bound names. For computational applications such as programming and formal reasoning, it is desirable to develop constructive type theories for nominal logic which extend standard type theories for propositional, firstor higher-order logic. This has proven difficult, largely because ...
متن کاملSimple Type Theory as a Clausal Theory
Deduction modulo is an extension of first-order predicate logic where axioms are replaced by rewrite rules. For instance, the axiom P ⇔ (Q ⇒ R) is replaced by the rule P −→ (Q ⇒ R). These rules define an equivalence relation and, in a proof, a proposition can be replaced by an equivalent one at any time. A presentation of Simple Type Theory in Deduction modulo, calledHOL, has been given in [3]....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1998
ISSN: 0167-6423
DOI: 10.1016/s0167-6423(98)00011-2